A Variable Neighborhood Search for Hybrid Flexible Flowshops with Setup Times Minimizing Total Completion Time
نویسندگان
چکیده
منابع مشابه
An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملMinimizing Mean Completion Time in Flowshops with Random Processing Times
RACT : We consider the two-machine flowshop scheduling problem where jobs have random processing times are bounded within certain intervals. The objective is to minimize total completion time of all jobs. The decision of a solution for the problem has to be made based on the lower and upper bounds on job processing times since this only information available. The problem is NP-hard since the sp...
متن کاملMinimizing the total completion time in a two-machine flowshop with sequence-independent setup times
We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to setup times. We propose a new priority rule, several constructive heuristics, local search procedures, as well as an effective multiple crossover genetic algorithm. Computational experiments carried out on a large set of randomly generated instances provide evidence that a construc...
متن کاملMinimizing Total Tardiness in a Hybrid Flexible Flowshop with Sequence Dependent Setup Times
In this paper, we propose different local search algorithms to solve a realistic variant of the flowshop problem. The variant considered here is a hybrid flexible flowshop problem with sequence-dependent setup times, and with the objective of minimizing the total tardiness. In this variant of flowshop, stage skipping might occur, i.e., not all stages must be visited by all jobs. This scheduling...
متن کاملan iterated greedy algorithm for flexible flow lines with sequence dependent setup times to minimize total weighted completion time
this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2008
ISSN: 1812-5654
DOI: 10.3923/jas.2008.2843.2850